CRYPTOGRAPHIC ALGORITHM USING MATRIX INVERSION AS DATA PROTECTION
نویسندگان
چکیده
منابع مشابه
Inverse modeling of HEM data using a new inversion algorithm
Helicopter-borne frequency-domain electromagnetic (HEM) surveys are used extensively for mineral and groundwater exploration and a number of environmental investigations. To have a meaningful interpretation of the measured multi- frequency HEM data, in addition to the resistivity maps which are provided in each frequency or for some particular depth levels, it is a necessity ...
متن کاملinverse modeling of hem data using a new inversion algorithm
helicopter-borne frequency-domain electromagnetic (hem) surveys are used extensively for mineral and groundwater exploration and a number of environmental investigations. to have a meaningful interpretation of the measured multi- frequency hem data, in addition to the resistivity maps which are provided in each frequency or for some particular depth levels, it is a necessity to have a suit...
متن کاملCryptographic Protection of Computer-Based Data Files
This article explores the nature of cryptographic transformation and its application to the protection of data contained in files used by computer-based information systems. It presents some of the basic concepts of cryptography and structures of taxonomy of cryptographic transformations. The implications of computer oriented implementations of cryptographic protection are explored and the sign...
متن کاملAppendix B : Cryptographic Protection of IKE Data
This document describes version 2 of the IKE (Internet Key Exchange) protocol. IKE performs mutual authentication and establishes an IKE security association that can be used to efficiently establish SAs for ESP, AH and/or IPcomp. This version greatly simplifies IKE by replacing the 8 possible phase 1 exchanges with a single exchange based on either public signature keys or shared secret keys. ...
متن کاملMatrix Inversion Is As Easy As Exponentiation
Abstract. We prove that the inverse of a positive-definite matrix can be approximated by a weighted-sum of a small number of matrix exponentials. Combining this with a previous result [6], we establish an equivalence between matrix inversion and exponentiation up to polylogarithmic factors. In particular, this connection justifies the use of Laplacian solvers for designing fast semi-definite pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Information and Communication Technology
سال: 2011
ISSN: 1675-414X,2180-3862
DOI: 10.32890/jict.10.2011.8109